Numerical Algorithm for a Class of Linear Fractional Programming Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Effective Algorithm for Globally Solving a Class of Linear Fractional Programming Problem
This article presents a branch-and-bound algorithm for globally solving the general linear sum of ratios problem (GFP). By utilizing equivalent transformation and linearization technique, a linear relaxation programming (LRP) of original problem is constructed. The algorithm economizes the required computations by conducting the branch-and-bound search in p R , rather than in n R , where p is t...
متن کاملA Suggested Approach for Stochastic Interval-Valued Linear Fractional Programming problem
In this paper, we considered a Stochastic Interval-Valued Linear Fractional Programming problem(SIVLFP). In this problem, the coefficients and scalars in the objective function are fractional-interval, and technological coefficients and the quantities on the right side of the constraints were random variables with the specific distribution. Here we changed a Stochastic Interval-Valued Fractiona...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملSolving Intuitionistic Fuzzy Linear Fractional Programming Problem
A new method is proposed to find an optimal intuitionistic fuzzy solution to fully intuitionistic fuzzy linear fractional programming (IFLFP) problem, in which ranking functions are not used. Here, the IFLFP problem is transformed into an equivalent crisp linear fractional programming problem which is then solved by linear programming (LP) technique and / or linear fractional programming techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2013
ISSN: 1812-5638
DOI: 10.3923/itj.2013.6871.6876